Proof Complexity of Hard-Determinable Balanced Tautologies in Frege Systems
نویسندگان
چکیده
Hard-determinable property and balanced of tautologies are specified as important properties in the study proof complexities formerly. In this paper hard-determinable studied together. It is shown that some sequences hard determinable have polynomially bounded Frege proofs.
منابع مشابه
On the computational complexity of finding hard tautologies
It is well-known (cf. K.-Pudlák[18]) that a polynomial time algorithm finding tautologies hard for a propositional proof system P exists iff P is not optimal. Such an algorithm takes 1 (k) and outputs a tautology τ k of size at least k such that P is not p-bounded on the set of all τ k 's. We consider two more general search problems involving finding a hard formula, Cert and Find, motivated by...
متن کاملNondeterministic Instance Complexity and Hard-to-Prove Tautologies
In this note we rst formalize the notion of hard tautologies using a nondeterministic generalization of instance complexity. We then show, under reasonable complexity-theoretic assumptions, that there are innnitely many propositional tautologies that are hard to prove in any sound propositional proof system.
متن کاملPlausibly hard combinatorial tautologies
We present a simple propositional proof system which consists of a single axiom schema and a single rule, and use this system to construct a sequence of combinatorial tautologies that, when added to any Frege system, p-simulates extended-Frege systems.
متن کاملA reduction of proof complexity to computational complexity for $AC^0[p]$ Frege systems
We give a general reduction of lengths-of-proofs lower bounds for constant depth Frege systems in DeMorgan language augmented by a connective counting modulo a prime p (the so called AC[p] Frege systems) to computational complexity lower bounds for search tasks involving search trees branching upon values of maps on the vector space of low degree polynomials over Fp. In 1988 Ajtai [2] proved th...
متن کاملAre there Hard Examples for Frege Systems?
It is generally conjectured that there is an exponential separation between Frege and extended Frege systems. This paper reviews and introduces some candidates for families of combinatorial tautologies for which Frege proofs might need to be superpolynomially longer than extended Frege proofs. Surprisingly, we conclude that no particularly good or convincing examples are known. The examples of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical problems of computer science
سال: 2022
ISSN: ['2579-2784']
DOI: https://doi.org/10.51408/1963-0093